On the Algebraic Immunity of Boolean Function
نویسندگان
چکیده
In view of the construction requirements of Boolean functions with many good cryptography properties, through the analysis of the relationship between the function values on the vectors with weight not more than d and the algebraic immunity, a method to determine the higher order algebraic immunity function is given. Meanwhile, a method that appropriate change in the function value without reducing algebraic immunity is produced, and using it, an example to construct Boolean function with optimal properties in the algebraic immunity, nonlinearity, balance and correlation immunity etc is presented.
منابع مشابه
Construction and Count of Boolean Functions of an Odd Number of Variables with Maximum Algebraic Immunity
Algebraic immunity has been proposed as an important property of Boolean functions. To resist algebraic attack, a Boolean function should possess high algebraic immunity. It is well known now that the algebraic immunity of an n-variable Boolean function is upper bounded by ⌈ n 2 ⌉ . In this paper, for an odd integer n, we present a construction method which can efficiently generate a Boolean fu...
متن کاملNew construction of Boolean function with optimum algebraic immunity
Because of the algebraic attacks, a high algebraic immunity is now an important criteria for Boolean functions used in stream ciphers. In this paper, by using the relationship between some flats and support of a n variables Boolean function f , we introduce a general method to determine the algebraic immunity of a Boolean function and finally construct some balanced functions with optimum algeb...
متن کاملA note on linear codes and algebraic immunity of Boolean functions
Since 2003, Algebraic Attacks have received a lot of attention in the cryptography literature. In this context, algebraic immunity quantifies the resistance of a Boolean function to the standard algebraic attack of the pseudo-random generators using it as a nonlinear Boolean function. A high value of algebraic immunity is now an absolutely necessary cryptographic criterion for a resistance to a...
متن کاملOn the (Fast) Algebraic Immunity of Boolean Power Functions
The (fast) algebraic immunity, including (standard) algebraic immunity and the resistance against fast algebraic attacks, has been considered as an important cryptographic property for Boolean functions used in stream ciphers. This paper is on the determination of the (fast) algebraic immunity of a special class of Boolean functions, called Boolean power functions. An n-variable Boolean power f...
متن کاملOn $2k$-Variable Symmetric Boolean Functions with Maximum Algebraic Immunity $k$
Algebraic immunity of Boolean function f is defined as the minimal degree of a nonzero g such that fg = 0 or (f + 1)g = 0. Given a positive even integer n, it is found that the weight distribution of any n-variable symmetric Boolean function with maximum algebraic immunity n 2 is determined by the binary expansion of n. Based on the foregoing, all n-variable symmetric Boolean functions with max...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014